Modeling of Distributed Systems by Concurrent Regular Expressions
نویسنده
چکیده
We propose an algebraic model called concurrent regular expressions for modeling and analysis of distributed systems. These expressions extend regular expressions with four operators-interleaving, interleaving closure, synchronous composition and renaming. Their expressive power is equivalent to those of Petri nets, and therefore they are more general than Path expressions and COSY expressions.
منابع مشابه
Theory of Test Modeling Based on Regular Expressions
This paper presents a theory of test modeling by using regular expressions for software behaviors. Unlike the earlier modeling theory of regular expression, the proposed theory is used to build a test model which can derive effective test sequences easily. We firstly establish an expression algebraic system by means of transition sequences and a set of operators. And we then give the modeling m...
متن کاملConcurrent Regular Expressions and Their Relationship to Petri Nets
We deene algebraic systems called concurrent regular expressions which provide a modular description of languages of Petri nets. Concurrent regular expressions are extension of regular expressions with four operators-interleaving, interleaving closure, synchronous composition and renaming. This alternative characterization of Petri net languages gives us a exible way of specifying concurrent sy...
متن کاملFormalization of UML Statechart Models Using Concurrent Regular Expressions
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current version of UML is semi-formal, it is difficult to determine whether the model is consistent, unambiguous, or complete. This paper proposes the transformation rules for formalizing UML statechart diagrams. The target languag...
متن کاملA Typed Calculus for Querying Distributed XML Documents
We study the problems related to querying large, distributed XML documents. Our proposal takes the form of a new process calculus in which XML data are processes that can be queried by means of concurrent pattern-matching expressions. What we achieve is a functional, strongly-typed programming model based on three main ingredients: an asynchronous process calculus that draws features from π-cal...
متن کاملCTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for genetic regulatory networks (Grns). Applications of model checking in systems biology have revealed that temporal logics should be able to capture both branching-time and fairness properties (needed for specifying multistability and oscillation properties, respectively). At the same time, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989